Cyclic codes from two-prime generalized cyclotomic sequences of order 6
نویسندگان
چکیده
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF(q) and give their generator polynomials. And we also calculate the minimum distance of some cyclic codes and give lower bounds of the minimum distance for some other cyclic codes.
منابع مشابه
Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
Abstract. BinaryWhiteman’s cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman’s generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that the autocorrelation values of this sequence is four-valued or five-valued if (n1−1)(n2−1)/36...
متن کاملAutocorrelation values and Linear complexity of generalized cyclotomic sequence of order four, and construction of cyclic codes
Let n1 and n2 be two distinct primes with gcd(n1 − 1, n2 − 1) = 4. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order 4. Our results show that this sequence can have very good autocorrelation property. We determine the linear complexity and minimal polynomial of the generalized cyclotomic sequence over GF(q) where q = pm and p is an odd prime. Our r...
متن کاملAutocorrelation of New Generalized Cyclotomic Sequences of Period pn
Let n ≥ 2 be a positive integer and Z× n be the multiplicative group of the integer ring Zn. For a partition {Di|i = 0, 1, · · · , d − 1} of Z× n , if there exist elements g1, · · · , gd of Z× n satisfying Di = giD0 for all i where D0 is a multiplicative subgroup of Z× n , the Di are called generalized cyclotomic classes of order d. There have been lots of studies about cyclotomy with respect t...
متن کاملOn the semiprimitivity of cyclic codes
We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic code c(p, m, v) with v prime and p of index 2 modulo v is a two-weight code if and only if it is a semiprimitive code or it is one of the six sporadic known codes. The result is proved without any exception for index-two irreducible cyclic c(p, m, v) codes with v prime not c...
متن کاملRemarks on a cyclotomic sequence
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849–1853, 2005). First we determine the linear complexity of a natural generalization of this binary sequence to arbitrary prime fields. Secondly we consider k-error linear complexity and autocorrelation of these sequences and point out certain drawbacks of this c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 10 شماره
صفحات -
تاریخ انتشار 2016